An algorithm for ranking assignments using reoptimization
نویسندگان
چکیده
We consider the problem of ranking assignments according to cost in the classical linear assignment problem. An algorithm partitioning the set of possible assignments, as suggested by Murty, is presented where, for each partition, the optimal assignment is calculated using a new reoptimization technique. Its computational performance is compared with all available implementations of algorithms with the same time complexity. The results are encouraging.
منابع مشابه
A note on ranking assignments using reoptimization
We consider the problem of ranking assignments according to cost in the classical linear assignment problem. An algorithm partitioning the set of possible assignments, as suggested by Murty, is presented where, for each partition, the optimal assignment is calculated using a new reoptimization technique. Computational results for the new algorithm are presented.
متن کاملErratum to "An algorithm for ranking assignments using reoptimization" [Computers & Operations Research 35 (2008) 3714-3726]
In the paper Pedersen, Nielsen, and Andersen [5] we developed an algorithm for ranking n×n assignments using reoptimization and compare our algorithm with other algorithms with the same time complexity. However, as pointed out by Dr. A. Volgenant, we unfortunately missed one available implementation written by Miller, Stone, and Cox [3] in IEEE Transactions on Aerospace and Electronic Systems. ...
متن کاملReoptimization in Branch-and-Bound Algorithms with an Application to Elevator Control
We consider reoptimization (i.e., the solution of a problem based on information available from solving a similar problem) for branch-and-bound algorithms and propose a generic framework to construct a reoptimizing branch-and-bound algorithm. We apply this to an elevator scheduling algorithm solving similar subproblems to generate columns using branchand-bound. Our results indicate that reoptim...
متن کاملAn improved tabu search algorithm for the fixed-spectrum frequency-assignment problem
A tabu search algorithm with a dynamic tabu list for the fixed-spectrum frequency-assignment problem is presented. For cellular problems, the algorithm can be combined with an efficient cell reoptimization step. The algorithm is tested on several sets of test problems and compared with existing algorithms of established performance. In particular, it is used to improve some of the best existing...
متن کاملA note on a new variant of Murty's ranking assignments algorithm
In this paper a variant of Murty’s algorithm for ranking assignments according to cost is presented. It is shown that the worst-case computational complexity is better in this variant than in the original form of the algorithm. Computational results comparing three methods for ranking assignments are reported. They show that the behaviour of the new variant is also better in practice.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & OR
دوره 35 شماره
صفحات -
تاریخ انتشار 2008